Multi-objective method for divisible load scheduling in multi-level tree network
نویسندگان
چکیده
منابع مشابه
Divisible Load Scheduling on Multi - level Processor Trees
Divisible Load Theory (DLT) is an effective tool for blueprinting data-intensive computational problems. Heuristic algorithms have been proposed in the past to solve for a DLS (Divisible Load Schedule) with result collection on heterogeneous star networks. However scheduling on heterogeneous multi-level trees with result collection is still an open problem. In this thesis, new heuristic algorit...
متن کاملA Multi-Objective Method for Network Reconfiguration (TECHNICAL NOTE)
This paper presents an algorithm based on multi-objective approach for network reconfiguration. Multiple objectives are considered for reduction in the system power loss, deviations of the nodes voltage and transformers loading imbalance, while subject to a radial network structure in which all the loads must be energized and no branch current constraint is violated. These three objectives are ...
متن کاملMulti-Criteria Based Algorithm for Scheduling Divisible Load
Divisible load theory has become a popular area of research during the past two decades. Based on divisible load theory the computations and communications can be divided into some arbitrarily independent parts and each part can be processed independently by a processor. Existing divisible load scheduling algorithms do not consider any priority for allocating fraction of load. In some situation...
متن کاملScheduling Single-Load and Multi-Load AGVs in Container Terminals
In this paper, three solutions for scheduling problem of the Single-Load and Multi-Load Automated Guided Vehicles (AGVs) in Container Terminals are proposed. The problem is formulated as Constraint Satisfaction and Optimization. When capacity of the vehicles is one container, the problem is a minimum cost flow model. This model is solved by the highest performance Algorithm, i.e. Network Simple...
متن کاملAn algorithm for multi-objective job shop scheduling problem
Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Future Generation Computer Systems
سال: 2016
ISSN: 0167-739X
DOI: 10.1016/j.future.2015.03.015